Sequential Search with Random Overlook Probabilities
نویسندگان
چکیده
منابع مشابه
ROMA: Random Overlook Mastering ATFM
Consider the arrival process defined by t i =i + ξ i , where ξ i are i.i.d random variables. First introduced in the 50's, this arrival process is of remarkable importance in Air Traffic Flow Management and other transportation systems, where scheduled arrivals are intrinsically subject to random variations; other frameworks where this model has proved to be capable of a good description of act...
متن کاملChildren’s sequential information search is sensitive to environmental probabilities
We investigated 4th-grade children's search strategies on sequential search tasks in which the goal is to identify an unknown target object by asking yes-no questions about its features. We used exhaustive search to identify the most efficient question strategies and evaluated the usefulness of children's questions accordingly. Results show that children have good intuitions regarding questions...
متن کاملRandom Walk Radiosity with Generalized Absorption Probabilities
In this paper we study random walk estimators for radiosity with generalized absorption probabilities. That is, a path will either die or survive on a patch according to an arbitrary probability. The estimators studied so far, the infinite path length estimator and finite path length one, can be considered as particular cases. Practical applications of the random walks with generalized probabil...
متن کاملRandom Walk Radiosity with generalized transition probabilities
In this paper we study random walk estimators for radiosity with generalized transition and absorption probabilities. That is, a path will travel from patch to patch according to an arbitrary transition probability, and survive or be absorbed in it according to another arbitrary absorption probability. The estimators studied so far, those with arbitrary absorption probabilities but with the For...
متن کاملLimiting search cost distribution for the move-to-front rule with random request probabilities
Consider a list of n files whose popularities are random. These files are updated according to the move-tofront rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as n tends to infinity. Some examples are supplied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1976
ISSN: 0090-5364
DOI: 10.1214/aos/1176343555